Globally Convergent Hybridization of Particle Swarm Optimization Using Line Search-Based Derivative-Free Techniques

نویسندگان

  • Andrea Serani
  • Matteo Diez
  • Emilio Fortunato Campana
  • Giovanni Fasano
  • Daniele Peri
  • Umberto Iemma
چکیده

The hybrid use of exact and heuristic derivative-free methods for global unconstrained optimization problems is presented. Many real-world problems are modeled by computationally expensive functions, such as problems in simulationbased design of complex engineering systems. Objective-function values are often provided by systems of partial differential equations, solved by computationally expensive black-box tools. The objective-function is likely noisy and its derivatives are often not available. On the one hand, the use of exact optimization methods might be computationally too expensive, especially if asymptotic convergence properties are sought. On the other hand, heuristic methods do not guarantee the stationarity of their final solutions. Nevertheless, heuristic methods are usually able to provide an approximate solution at a reasonable computational cost, and have been widely applied to real-world simulation-based design optimization problems. Herein, an overall hybrid algorithm combining the appealing properties of both exact and heuristic methods is discussed, with focus on Particle Swarm Optimization (PSO) and line search-based derivative-free algorithms. The theoretical A. Serani (&) M. Diez E.F. Campana CNR-INSEAN, Via di Vallerano 139, Rome, Italy e-mail: [email protected] M. Diez e-mail: [email protected] E.F. Campana e-mail: [email protected] G. Fasano Department of Management, University Ca’ Foscari of Venice, S. Giobbe, Cannaregio 873, Venice, Italy e-mail: [email protected] D. Peri CNR-IAC, Via dei Taurini 19, Rome, Italy e-mail: [email protected] A. Serani U. Iemma Department of Engineering, Roma Tre University, Via Vito Volterra 62, Rome, Italy e-mail: [email protected] © Springer International Publishing Switzerland 2015 X.-S. Yang (ed.), Recent Advances in Swarm Intelligence and Evolutionary Computation, Studies in Computational Intelligence 585, DOI 10.1007/978-3-319-13826-8_2 25 properties of the hybrid algorithm are detailed, in terms of limit points stationarity. Numerical results are presented for a specific test function and for two real-world optimization problems in ship hydrodynamics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pswarm: a Solver for Linearly Constrained Global Derivative-free Optimization

PSwarm was developed originally for the global optimization of functions without derivatives and where the variables are within upper and lower bounds. The underlying algorithm used is a pattern search method, more specifically a coordinate search method, which guarantees convergence to stationary points from arbitrary starting points. In the (optional) search step of coordinate search, the alg...

متن کامل

A Framework for Derivative Free Algorithm Hybridization

Column generation is a basic tool for the solution of largescale mathematical programming problems. We present a class of column generation algorithms in which the columns are generated by derivative free algorithms, like population-based algorithms. This class can be viewed as a framework to define hybridization of free derivative algorithms. This framework has been illustrated in this article...

متن کامل

IIR System Identification Using Improved Harmony Search Algorithm with Chaos

Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...

متن کامل

Particle swarm optimization for a bi-objective web-based convergent product networks

Here, a collection of base functions and sub-functions configure the nodes of a web-based (digital)network representing functionalities. Each arc in the network is to be assigned as the link between two nodes. The aim is to find an optimal tree of functionalities in the network adding value to the product in the web environment. First, a purification process is performed in the product network ...

متن کامل

A Study of the Efficiency of the Hybridization of a Particle Swarm Optimizer and Tabu Search

In this paper, we propose a hybrid Particle Swarm Optimization (PSO) called TS-Tribes which combine Tribes, a PSO algorithm free of parameters and Tabu Search (TS) technique. The main idea behind this hybridization is to combine the high convergence rate of Tribes with a local search technique based on TS. In addition, we study the impact of the place where we apply local search on the performa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015